package Test4;

import java.util.Scanner;

class TreeNode{
    public TreeNode left;
    public TreeNode right;
    public String color;
    public TreeNode paren;
    public TreeNode(TreeNode left, TreeNode right,TreeNode paren, String color) {
        this.left = left;
        this.right = right;
        this.paren=paren;
        this.color = color;
    }
}
public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        String[] c=new String[n];
        int[] paren=new int[n-1];
        if(n==1){
            System.out.println(1);
            return;
        }
        int index=0;
        while(sc.hasNext()){
            paren[index]=sc.nextInt();
            index++;
        }
        TreeNode root=new TreeNode(null,null,null,c[0]);
        //构建一颗二叉树

    }
}
